Face-Distinguishing Facially-Proper Entire-Labeling of Plane Graphs
نویسندگان
چکیده
An entire-labeling (with positive integers) of a plane graph G is facedistinguishing, if w(f1) = w(f2) for any two adjacent faces f1 and f2 of G, where w(f) denote the sum of labels of the vertices and edges incident with f and also the label of f . In this paper we prove that every plane graph admits a face-distinguishing facially-proper entirelabeling with at most 12 labels. Moreover, we improve this bound for some classes of graphs. Mathematics Subject Classification: 05C10, 05C78
منابع مشابه
Decompositions of plane graphs under parity constrains given by faces
An edge coloring of a plane graph G is facially proper if no two faceadjacent edges of G receive the same color. A facial (facially proper) parity edge coloring of a plane graph G is an (facially proper) edge coloring with the property that, for each color c and each face f of G, either an odd number of edges incident with f is colored with c, or color c does not occur on the edges of f . In th...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملEntire Labeling of Plane Graphs
A face irregular entire k-labeling φ : V ∪E ∪F → {1,2, . . . ,k} of a 2-connected plane graph G = (V,E,F) is a labeling of vertices, edges and faces of G in such a way that for any two different faces f and g their weights wφ ( f ) and wφ (g) are distinct. The weight of a face f under a k-labeling φ is the sum of labels carried by that face and all the edges and vertices incident with the face....
متن کاملA note on face coloring entire weightings of plane graphs
Given a weighting of all elements of a 2-connected plane graph G = (V,E, F ), let f(α) denote the sum of the weights of the edges and vertices incident with the face α and also the weight of α. Such an entire weighting is a proper face colouring provided that f(α) 6= f(β) for every two faces α and β sharing an edge. We show that for every 2-connected plane graph there is a proper face-colouring...
متن کاملDistinguishing number and distinguishing index of natural and fractional powers of graphs
The distinguishing number (resp. index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (resp. edge labeling) with $d$ labels that is preserved only by a trivial automorphism. For any $n in mathbb{N}$, the $n$-subdivision of $G$ is a simple graph $G^{frac{1}{n}}$ which is constructed by replacing each edge of $G$ with a path of length $n$...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014